Derivations of the Expected Energy Costs of Search and Replication in Wireless Sensor Networks
نویسندگان
چکیده
We develop closed-form expressions of the expected minimum search energy cost and replication energy cost for both unstructured sensor networks (which use blind sequential search for querying) and structured sensor networks (which use efficient hash-based querying). We use both the square grid and random topology to derive each cost modeling. We find that the search cost of unstructured networks is proportional to the number of nodes N and inversely proportional to (r + 1) (where r denotes the number of copies of the target event). The search cost of structured networks is proportional to √ N/ √ r while the replication cost of both structured and unstructured networks is proportional to √ N(r − 1). Furthermore, the proportionality of those costs is independent of whether the topology is grid or random, which implies that the two topologies have common structural characteristics in terms of search and replication costs.
منابع مشابه
Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملA New Method for Clustering Wireless Sensor Networks to Improve the Energy Consumption
Clustering is an effective approach for managing nodes in Wireless Sensor Network (WSN). A new method of clustering mechanism with using Binary Gravitational Search Algorithm (BGSA) in WSN, is proposed in this paper to improve the energy consumption of the sensor nodes. Reducing the energy consumption of sensors in WSNs is the objective of this paper that is through selecting the sub optimum se...
متن کاملImproving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملOptimization of Energy Consumption in Image Transmission in Wireless Sensor Networks (WSNs) using a Hybrid Method
In wireless sensor networks (WSNs), sensor nodes have limited resources with regard to computation, storage, communication bandwidth, and the most important of all, energy supply. In addition, in many applications of sensor networks, we need to send images to a sink node. Therefore, we have to use methods for sending images in which the number and volume of packets are optim...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006